Gestalt Effects in Planning: Rush-Hour as an example
نویسندگان
چکیده
Planning problems have been extensively studied with regard to graph theoretical properties such as the number of steps necessary to reach a specific goal state or the size of the problem space. These structural properties, however, do not completely characterize a problem. In the presented eye-tracking study we also investigated the influence of perceptual factors on the solution to a planning problem. While not affecting the correctness of a solution, the results suggest that certain Gestalt properties are responsible for the deviation from optimal plans.
منابع مشابه
Modelling Spatial Relations’ Influence on Planning
Recent studies on the planning problem Rush-Hour showed that certain spatial properties among the game’s elements affect human planning and bias it towards a suboptimal solution. A cognitive model that solves Rush-Hour problems has been implemented with the goal of better understanding this effect. The ACT-R framework has been chosen as the foundation for this experiment. The model has been eva...
متن کاملOn the parameterized complexity of the generalized rush hour puzzle
We consider the parameterized complexity of a generalized version of the game Rush Hour , which is a puzzle requiring the player to find a sequence of moves by vehicles to enable a special target vehicle to escape from a grid-shaped game board that may contain obstacles. Although the problem is PSPACE-complete, we demonstrate algorithms that work in polynomial time when either the total number ...
متن کاملA Structural Complexity Measure for Predicting Human Planning Performance
Humans have an impressive ability to solve even computationally complex problems. Limited cognitive processing capabilities, however, impede an exhaustive search of the problem space. Thus, planning problems of the same size may require a different cognitive effort. Formal complexity aspects are inherent to a problem and set computational limits that a solver must deal with. For a measure of co...
متن کاملTopics on the Ratliff-Rush Closure of an Ideal
Introduction Let be a Noetherian ring with unity and be a regular ideal of , that is, contains a nonzerodivisor. Let . Then . The :union: of this family, , is an interesting ideal first studied by Ratliff and Rush in [15]. The Ratliff-Rush closure of is defined by . A regular ideal for which is called Ratliff-Rush ideal. The present paper, reviews some of the known prop...
متن کاملPSPACE-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation
We present a nondeterministic model of computation based on reversing edge directions in weighted directed graphs with minimum in-flow constraints on vertices. Deciding whether this simple graph model can be manipulated in order to reverse the direction of a particular edge is shown to be PSPACEcomplete by a reduction from Quantified Boolean Formulas. We prove this result in a variety of specia...
متن کامل